More on linear inequalities with applications to matrix theory
نویسندگان
چکیده
منابع مشابه
Linear Matrix Inequalities with Stochastically Dependent Perturbations and Applications to Chance-Constrained Semidefinite Optimization
The wide applicability of chance–constrained programming, together with advances in convex optimization and probability theory, has created a surge of interest in finding efficient methods for processing chance constraints in recent years. One of the successes is the development of so–called safe tractable approximations of chance–constrained programs, where a chance constraint is replaced by a...
متن کاملMore on Membranes in Matrix Theory
We study noncompact and static membrane solutions in Matrix theory. Demanding axial symmetry on a membrane embedded in three spatial dimensions, we obtain a wormhole solution whose shape is the same with the catenoidal solution of Born-Infeld theory. We also discuss another interesting class of solutions, membranes embedded holomorphically in four spatial dimensions, which are 1/4 BPS. Matrix t...
متن کاملLinear optimization on Hamacher-fuzzy relational inequalities
In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Hamacher family of t-norms is considered as fuzzy composition. Hamacher family of t-norms is a parametric family of continuous strict t-norms, whose members are decreasing functions of ...
متن کاملLinear rank inequalities on five or more variables
Ranks of subspaces of vector spaces satisfy all linear inequalities satisfied by entropies (including the standard Shannon inequalities) and an additional inequality due to Ingleton. It is known that the Shannon and Ingleton inequalities generate all such linear rank inequalities on up to four variables, but it has been an open question whether additional inequalities hold for the case of five ...
متن کاملSubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. SubPoly is as expressive as Polyhedra, but it drops some of the deductive power to achieve scalability. SubPoly is based on the insight that the reduced product of linear equalities and intervals produces powerful yet scalable analyses. Precision can be recovered using hints. Hints ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1971
ISSN: 0022-247X
DOI: 10.1016/0022-247x(71)90072-2